Many-box locality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locality-Aware Many-Core Garbage Collection

The wide-scale deployment of multi-core and many-core processors will necessitate fundamental changes to garbage collectors. Highly parallel garbage collection is critical to the performance of these systems — today’s garbage collectors can quickly become the bottleneck for parallel programs. These processors will present additional new challenges — many contain non-uniform memory architectures...

متن کامل

Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds

We show that any concurrent zero-knowledge protocol for a non-trivial language (i.e., for a language outside BPP), whose security is proven via black-box simulation, must use at least ~ (log n) rounds of interaction. This result achieves a substantial improvement over previous lower bounds, and is the rst bound to rule out the possibility of constant-round concurrent zero-knowledge when proven ...

متن کامل

Covering many points with a small-area box

Let P be a set of n points in the plane. We show how to find, for a given integer k > 0, the smallest-area axis-parallel rectangle that covers k points of P in O(nk log n+ n log n) time. We also consider the problem of, given a value α > 0, covering as many points of P as possible with an axis-parallel rectangle of area at most α. For this problem we give a randomized (1−ε)-approximation that w...

متن کامل

Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves

Space-filling curves can be used to organise points in the plane into bounding-box hierarchies (such as R-trees). We develop measures of the bounding-box quality of space-filling curves that express how effective different space-filling curves are for this purpose. We give general lower bounds on the bounding-box quality measures and on locality according to Gotsman and Lindenbaum for a large c...

متن کامل

Locality Sim: Cloud Simulator with Data Locality

Cloud Computing (CC) is a model for enabling on-demand access to a shared pool of configurable computing resources. Testing and evaluating the performance of the cloud environment for allocating, provisioning, scheduling, and data allocation policy have great attention to be achieved. Therefore, using cloud simulator would save time and money, and provide a flexible environment to evaluate new ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2017

ISSN: 2469-9926,2469-9934

DOI: 10.1103/physreva.96.052108